Random logistic maps and Lyapunov exponents

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Logistic Maps and Lyapunov Exponents

We prove that under certain basic regularity conditions, a random iteration of logistic maps converges to a random point attractor when the Lyapunov exponent is negative, and does not converge to a point when the Lyapunov exponent is positive.

متن کامل

Uniform Hyperbolicity for Random Maps with Positive Lyapunov Exponents

We consider some general classes of random dynamical systems and show that a priori very weak nonuniform hyperbolicity conditions actually imply uniform hyperbolicity.

متن کامل

Hyperbolicity Estimates for Random Maps with Positive Lyapunov Exponents

Date: 16 January 2006. 2000 Mathematics Subject Classification. 37H15.

متن کامل

Lyapunov Exponents in Random Boolean Networks

A new order parameter approximation to Random Boolean Networks (RBN) is introduced, based on the concept of Boolean derivative. A statistical argument involving an annealed approximation is used, allowing to measure the order parameter in terms of the statistical properties of a random matrix. Using the same formalism, a Lyapunov exponent is calculated, allowing to provide the onset of damage s...

متن کامل

Asymptotic Lyapunov Exponents for Large Random Matrices

Suppose that A1, . . . , AN are independent random matrices whose atoms are iid copies of a random variable ξ of mean zero and variance one. It is known from the works of Newman et. al. in the late 80s that when ξ is gaussian then N−1 log ‖AN . . . A1‖ converges to a non-random limit. We extend this result to more general matrices with explicit rate of convergence. Our method relies on a simple...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indagationes Mathematicae

سال: 2001

ISSN: 0019-3577

DOI: 10.1016/s0019-3577(01)80042-2